The Source Coding Game With a Cheating Switcher
نویسندگان
چکیده
منابع مشابه
Cheating in the Trust Game
A large experimental literature has investigated the determinants of trust using variants of the so called trust game. However, a lot of ambiguity remains regarding the definition of what one is trusting: one extreme view is that since there are no explicit promises or guarantees made in the trust game, cheating is not defined and therefore trust is not implied. We address this concern by askin...
متن کاملLila: A Cheating-Resistant Distributed Game Engine
In this paper we present Lila, a distributed multiplayer game engine that is Byzantine faulttolerant. Lila allows games to be written with little regard for issues such as move replication, rejection of cheating moves, allowing new players to join the game, allowing players to leave the game, and removing cheating or networkpartitioned players from the game. Lila is based on Practical Byzantine...
متن کاملThe Mind Game: Invisible Cheating and Inferable Intentions
This paper exploits a novel cheating game the “Mind Game” to show how a subtle variation in the rules of the game affects cheating. In both variants of the game, cheating is invisible because subjects make their choices purely in their minds. The only difference rests on the order of the steps in which subjects should play the game. I find that subjects cheat significantly less when they have t...
متن کاملEvolving cheating DNA networks: a Case Study with the Rock–Paper–Scissors Game
In models of games, the indirect interactions between players, such as body language or knowledge about the other’s playstyle, are often omitted. They are, however, a rich source of information in real life, and increase the complexity of possible strategies. In the game of rock-paper-scissors, the simple monitoring of the opponent’s move before it was played is a sufficient condition to trigge...
متن کاملSource Coding with Renyis Entropy
A new measure called average code word length of order is defined and its relationship with Renyi's entropy of order is discussed. Using some coding theorems are proved under the condition Refer ences
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2011
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2145730